Competitive Optimality of Source Codes TABLE I COMPETITIVELY OFTIMAL HUFFMAN CODE
نویسنده
چکیده
4ompetitively optimal coding is considered and the following is proved. 1) If the competitively optimal code exists for a glven source probability p(z), then it also attains the minimum expected codeword length 2) If the Huffman code tree for p(z) is unbalanced in probability weight, then the competitively optimal code does not exist. Furthermore, the relation between competitively optimal coding and game theory is considered. Ph Code A zA(x) OTli 0 1 b 0.3
منابع مشابه
Average-sense optimality and competitive optimality for almost instantaneous VF codes
One-shot coding and repeated coding are considered for the class of almost instantaneous variable-to-fixed length (AIVF) codes, AIVF, which includes some nonproper VF codes in addition to the class of proper VF codes, PVF. An algorithm is given to construct the average-sense optimal (a-optimal) AIVF code in one-shot coding that attains the maximum average parse length in AIVF. The algorithm can...
متن کاملUniversal Source Codes Lecturer : Himanshu Tyagi Scribe : Sandip Sinha
• Huffman Code (optimal prefix-free code) • Shannon-Fano code • Shannon-Fano-Elias code • Arithmetic code (can handle a sequence of symbols) In general, the first three codes do not achieve the optimal rate H(X), and there are no immediate extensions of these codes to rate-optimal codes for a sequence of symbols. On the other hand, arithmetic coding is rate-optimal. However, all these schemes a...
متن کاملThe Rényi redundancy of generalized Huffman codes
If optimality is measured by average codeword length, Huffman's algorithm gives optimal codes, and the redundancy can be measured as the difference between the average codeword length and Shannon's entropy. If the objective function is replaced by an exponentially weighted average, then a simple modification of Huffman's algorithm gives optimal codes. The redundancy can now be measured as the d...
متن کاملJoint Source-Channel Decoding of JPEG Images using Error Resilient Source Codes
Iterative decoding of JPEG images does not perform well due to the poor distance property of the original JPEG Huffman codes. We propose a symmetric RVLC with large free distance which can dramatically improve the system performance when iterative decoding is performed. Simulation results indicate up to 4 dB coding gain is achievable. There is a significant body of literature (see references in...
متن کاملOptimal Maximal Prefix Coding and Huffman Coding
Huffman coding has been widely used in data, image, and video compression. Novel maximal prefix coding different from the Huffman coding is introduced. Relationships between the Huffman coding and optimal maximal prefix coding are discussed. We show that all Huffman coding schemes are maximal prefix coding schemes and have the shortest average code word length among maximal prefix coding scheme...
متن کامل